general complex fuzzy transformation semigroups in automata

نویسندگان

mohammad horry

shahid chamran university of kerman, kerman, iran

چکیده

in this paper, we define the concepts of a complex fuzzy subset and a complex fuzzy finite state automaton. then we extend the notion of a complex fuzzy finite state automaton and introduce the notion of a general complex fuzzy automaton. after that we define the concept of a max- min general complex fuzzy automaton and construct some equivalence relations and some congruence relations in a max-min general complex fuzzy automaton and obtain different types of monoids in a max-min general complex fuzzy automaton and define a homomorphism between them. then we define the concepts of a general complex fuzzy transformation semi- group, a faithful general complex fuzzy transformation semigroup and a faithful general complex fuzzy transformation semigroup associated with a max-min general complex fuzzy automaton. then we derive relationships between a max-min general complex fuzzy automaton and a general complex fuzzy transformation semigroup.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Transformation of BL-general Fuzzy Automata

In this paper, we prove that any BL-general fuzzy automaton (BL-GFA) and its quotient have the same behavior. In addition, we obtain the minimal quotient BL-GFA and minimal quotient transformation of the BL-GFA, considering the notion of maximal admissible partition. Furthermore, we show that the number of input symbols and time complexity of the minimal quotient transformation of a BL-GFA are ...

متن کامل

Bipolar general fuzzy automata

In this paper, we define the notion of a bipolar general fuzzy automaton, then we construct some closure operators on the set of states of a bipolar general fuzzy automaton. Also, we construct some topologies on the set of states of a bipolar general fuzzy automaton. Then we obtain some relationships between them.

متن کامل

Irreducibility on General Fuzzy Automata

The aim of this paper is the study of a covering of a max-mingeneral fuzzy automaton by another, admissible relations, admissiblepartitions of a max-min general fuzzy automaton,$tilde{delta}$-orthogonality of admissible partitions, irreduciblemax-min general fuzzy automata. Then we obtain the relationshipsbetween them.  

متن کامل

Some (Fuzzy) Topologies on General\ Fuzzy Automata

In this paper, by presenting some notions and theorems, we obtaindifferent types of fuzzy topologies. In fact, we obtain someLowen-type  and Chang-type fuzzy topologies on general fuzzyautomata. To this end, first we define a Kuratowski fuzzy interioroperator which induces a  Lowen-type  fuzzy topology on the  set ofstates of a max- min general   fuzzy automaton. Also by  provingsome theorems, ...

متن کامل

HYPERGROUPS AND GENERAL FUZZY AUTOMATA

In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...

متن کامل

Reduction of BL-general L-fuzzy Automata

In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of advances in computer research

جلد ۷، شماره ۲، صفحات ۱۲۷-۱۳۷

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023